Task assignment and organizational form

Hybrid Meta-heuristic Algorithm for Task Assignment Problem

Task assignment problem (TAP) involves assigning a number of tasks to a number of processors in distributed computing systems and its objective is to minimize the sum of the total execution and communication costs, subject to all of the resource constraints. TAP is a combinatorial optimization problem and NP-complete. This paper proposes a hybrid meta-heuristic algorithm for solving TAP in a ...

Minimal Static Single Assignment Form

This formalization is an extension to [3]. In their work, the authors have shown that Braun et al.’s static single assignment (SSA) construction algorithm [1] produces minimal SSA form for input programs with a reducible control flow graph (CFG). However Braun et al. also proposed an extension to their algorithm that they claim produces minimal SSA form even for irreducible CFGs. In this formal...

Task Assignment with Unknown Duration

Organizational Form and the Market for Talent

This article brings together the market for products, the market for talent, and firms’ organizational form. While the organizational design determines the allocation of blame and fame within the firm, the value of a good reputation depends on the market structure. Consequently, the market structure dictates the optimal organizational design. If competition becomes tougher and the market thicke...

Task Assignment and Scheduling under Memory Constraints

Many DSP and image processing embedded systems have hard memory constraints which makes it difficult to find a good task assignment and scheduling which fulfill these constraints. This paper presents a new heuristic developed for task assignment and scheduling for such systems. These systems have also a large number of constraints of different nature, such as cost, execution time, memory capaci...